Abstract interpretation - PDFSEARCH.IO - Document Search Engine

Abstract interpretation
Results: 510

#	Item
331	COMPUTING THE WORST CASE EXECUTION TIME OF AN AVIONICS PROGRAM BY ABSTRACT INTERPRETATION Jean Souyris* ([removed]), Erwan Le Pavec* ([removed]), Guillaume Himbert* (guillaume.himbert@airbus. Add to Reading List Source URL: www.absint.com Language: English - Date: 2011-01-26 09:33:00 Technology Worst-case execution time CPU cache Parallel computing Computer Central processing unit Pointer Out-of-order execution Real-time computing Computing Electronics
332	Our Sparrow Experience with Abstract Interpretation + Impure Catalysts Kwangkeun Yi ropas.snu.ac.kr/~kwang Research on Software Analysis for Error-free Computing Center School of Computer Science and Engineering Add to Reading List Source URL: samate.nist.gov Language: English - Date: 2013-05-07 16:54:58 C programming language C++ Sizeof CTX Null Sparrow Memory leak Computing Computer programming Software engineering
333	´ for C Astree Astr´ee analyzes safety-critical structured C programs with complex memory usage conforming to the C99 standard. This targets embedded applications as found in earth transportation, nuclear energy, medic Add to Reading List Source URL: www.absint.com Language: English - Date: 2015-01-19 06:15:30 C programming language Cross-platform software Abstract interpretation Astrée MISRA C Source code C SQL Pointer Computing Software engineering Computer programming
334	Probabilistic Language Modelling Part III Project May 2002 Abstract Language models assign probabilities to strings of symbols. Their interpretation is reviewed and applied to text classification. A language Add to Reading List Source URL: www.inference.phy.cam.ac.uk Language: English - Date: 2002-05-24 06:45:17 Probability N-gram Language model Bigram Hidden Markov model Markov chain Entropy Forward–backward algorithm Graphical model Statistics Markov models Probability and statistics
335	Effective Abstractions for Verification under Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2014-11-06 11:16:38 Circular buffer Software engineering Data buffer Thread Abstract interpretation Parallel computing Variable Function Computer memory Mathematics Computing
336	Burgess on Plural Logic and Set Theory Øystein Linnebo University of Bristol September[removed]Abstract Add to Reading List Source URL: www.oysteinlinnebo.org Language: English - Date: 2012-10-19 03:56:47 Model theory Set theory Predicate logic Z notation Formal systems First-order logic Reflection principle Interpretation Constructible universe Mathematical logic Logic Mathematics
337	Solutions to Selected Exercises (A complete solutions manual is available for instructors. Requests should be made on official letterhead directly to the author at the Department of Philosophy, Tulane University, New Orl Add to Reading List Source URL: spot.colorado.edu Language: English - Date: 2001-01-11 15:24:37 Propositional calculus Semantics Boolean algebra Binary operations If and only if Truth table Logical biconditional Tautology Interpretation Mathematics Logic Abstract algebra
338	Automatic Synthesis of Deterministic Concurrency Veselin Raychev (ETH Zurich) Martin Vechev (ETH Zurich) Eran Yahav (Technion) Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2013-07-15 05:03:33 Thread Synchronization Abstract interpretation Concurrency Communication Concurrent computing
339	1 FREGE’S PROOF OF REFERENTIALITY ØYSTEIN LINNEBO Abstract. I present a novel interpretation of Frege’s attempt at Grundgesetze I §§29-31 to prove that every expression of his language has a unique reference. I a Add to Reading List Source URL: www.oysteinlinnebo.org Language: English - Date: 2012-10-19 03:56:55 Philosophical logic Philosophy of language Semantics Meaning Analytic philosophers Gottlob Frege Sense and reference Begriffsschrift Function Analytic philosophy Logic Philosophy
340	Partial-Coherence Abstractions for Relaxed Memory Models Michael Kuperstein Martin Vechev Eran Yahav ∗ Add to Reading List Source URL: www.srl.inf.ethz.ch Language: English - Date: 2011-10-04 10:22:48 Mathematics Formal methods Formal languages Programming language semantics Memory barrier Abstract interpretation Operational semantics Abstraction Formal verification Theoretical computer science Logic in computer science Applied mathematics

UPDATE